منابع مشابه
Approximate $n-$ideal amenability of module extension Banach algebras
Let $mathcal{A}$ be a Banach algebra and $X$ be a Banach $mathcal{A}-$bimodule. We study the notion of approximate $n-$ideal amenability for module extension Banach algebras $mathcal{A}oplus X$. First, we describe the structure of ideals of this kind of algebras and we present the necessary and sufficient conditions for a module extension Banach algebra to be approximately n-ideally amenable.
متن کاملIdeal Hierarchical (t, n) Secret Sharing Schemes
A secret sharing scheme divides a secret into multiple shares by a dealer and shared among shareholders in such a way that any authorized subset of shareholders can reconstruct the secret; whereas any un-authorized subset of shareholders cannot recover the secret. If the maximal length of shares is equal to the length of the secret in a secret sharing scheme, the scheme is called ideal. If the ...
متن کاملHigh-n Ideal TAE Stability of ITER
The ideal MHD stability analysis of high-n (n is the toroidal mode number) Toroidal Alfvén Eigenmodes (TAE’s) is presented, using realistic and completely general ITER equilibria with shaped, up-down asymmetric, magnetic flux surfaces. An approach has been used, based on analytical-theoretical methods, which can give interesting results and allows us to analyze the conditions for enhanced TAE d...
متن کاملAn Ideal Boundary for Domains in N-space
The Royden ideal boundary of a domain is the set of all points in the maximal ideal space of the domain's Royden algebra that do not lie in the domain. Elements of the Royden ideal boundary can be characterized as nets convergent in both the weak and Euclidean topologies that have no subnet which is a sequence. As with other function algebras, boundary bers can be deened as subsets of all point...
متن کاملEfficient, XOR-Based, Ideal (t, n)- threshold Schemes
We propose a new, lightweight (t, n)−threshold secret sharing scheme that can be implemented using only XOR operations. Our scheme is based on an idea extracted from a patent application by Hewlett Packard that utilises error correction codes. Our scheme improves on the patent by requiring fewer randomly generated bits and by reducing the size of shares given to each player, thereby making the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Fourier
سال: 2016
ISSN: 2541-5239,2252-763X
DOI: 10.14421/fourier.2016.52.65-70